Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints

Asymptotic capacity of two-dimensional channels with checkerboard constraints

A checkerboard constraint is a bounded measurable set 2, containing the origin. A binary labeling of the 2 lattice satisfies the checkerboard constraint if whenever 2 is labeled 1, all of the other 2-lattice points in the translate + are labeled 0. Two-dimensional channels that only allow labelings of 2 satisfying checkerboard constraints are studied. Let ( ) be the area of , and let ( ) mean t...

Improved bit-stuffing bounds on two-dimensional constraints - Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

We consider the two-dimensional (2-D) (d, IC) runlengthlimited constraint and the 2-D ‘no isolated bits’ constraint (in short, the n.i.b. constraint). A binary array on the square lattice satisfies the two-dimensional (d, IC) constraint if it satisfies the one-dimensional (d, IC) constraint in both vertical and horizontal directions. Similarly, an array on the hexagonal lattice satisfies the tw...

Measures of maximal entropy

We extend the results of Walters on the uniqueness of invariant measures with maximal entropy on compact groups to an arbitrary locally compact group. We show that the maximal entropy is attained at the left Haar measure and the measure of maximal entropy is unique.

Advanced Bit Stuffing Mechanism for Reducing CAN Message Response Time

Codes and Formulation of Appropriate Constraints via Entropy Measures

In present communication, we have developed the suitable constraints for the given the mean codeword length and the measures of entropy. This development has proved that Renyi’s entropy gives the minimum value of the log of the harmonic mean and the log of power mean. We have also developed an important relation between best 1:1 code and the uniquely decipherable code by using different measure...